The NetWork Project: Asynchronous Distributed Computing on Personal Workstations
نویسنده
چکیده
NetWork is an experiment in distributed computing. The idea is to make use of idle time on personal workstations while retaining their advantages of immediate and guarantied availability. NetWork wants to make use of otherwise idle resources only. The performance criterion of NetWork is the net work done per unit time not computing time or other measures of resource utilization. The NetWork model provides corresponding programming primitives for distributed computing. An implementation of a distributed asynchronous neural net serves as test application. Computing in an Asynchronous Distributed Environment ................................... 1 An Example: Neural Nets...................................................................................... 2 Design Goals ......................................................................................................... 4 Principles of Operation and NetWork Layers ....................................................... 5 NetWork Scheduling Strategy ............................................................................... 7 Components of the NetWork Model ..................................................................... 8 Idle Time Distribution and Economy of Recruitments ......................................... 9 NetWork Communications: Economy and Flexibility ........................................ 11 Implementation Environment and Experiences with NetWork .......................... 13 Looking Ahead .................................................................................................... 14 Literature ............................................................................................................. 15 How to Access NetWork ..................................................................................... 16 Biographical Note & Additional Information ..................................................... 16
منابع مشابه
DisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems
The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...
متن کاملDisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems
The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...
متن کاملAn Analysis of IEEE 1394 on Linux for Cluster Computing
The Network Of Workstations (NOWs) is the trend for distributed computing, and the costeffectiveness of networking system is one of the key issues for NOWs. The IEEE 1394 bus can be a cost-effective solution for linking a network of computers, in this paper, we tested the performance of IEEE 1394 on the Linux system, and discussed how to improve the IEEE 1394 performance towards cluster computi...
متن کاملAsynchronous Checkpointing for PVM Requires Message-Logging
Distributed computing using networked workstations o ers cost-e cient parallel computing, but the higher rate of failure requires e ective fault-tolerance. Asynchronous consistent checkpointing o ers a low-overhead solution. Parallel Virtual Machine (PVM) allows a heterogeneous network of UNIX workstations to serve immmediately as a distributed computer by providing message-passing services imp...
متن کاملDALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs
Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...
متن کامل